an approach towards solving large-scale allocation problems (modeling and solution algorithm)

نویسندگان

s. m. khalesizadeh ph.d., faculty of industrial engineering, sharif university of technology, tehran

a. basirian jahromi m. s., faculty of industrial engineering, sharif university of technology, tehran

چکیده

large-scale allocation problem (lsap) is considered to be an important problem in operations research. in this paper, we have tried to model a sample lsap and show that famous linear or approaches in use cannot efficiently help us challenge, develop and handle such cases. we begin with efforts in this area to conclude that timely, efficient and less costly solutions could be only developed under simplified models. then, a new approach will be introduced. we have tried to introduce an algorithm and applicative method to solve a sample lsap model and to show that famous or approaches, in use, cannot efficiently help us challenge, develop and handle such cases. we begin with model simplification, and conclude with a sample numerical solution of university entrance exam so that the efficiency of the method can be further explained.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Problem-Solving Solution to Large-Scale Scheduling Problems

Although the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, domain-specific techniques frequently solve problems in much better than exponential time. Unfortunately, constructing special-purpose systems is a knowledge–intensive and time-consuming process that requires a deep understanding of the domain and problem-solving architecture. The goal of ou...

متن کامل

A New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems

There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...

متن کامل

A Statistical Approach to Adaptive Problem-Solving for Large-Scale Scheduling and Resource-Allocation Problems

Our work focuses upon development of techniques for choosing among a set of altematives in the presence of incomplete information and varying costs of acquiring information. In our approach, we model the cost and utility of various alternatives using parameterized statistical models. By applying techniques from an area of statistics called parameter estimation, statistical models can be inferre...

متن کامل

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

متن کامل

a new play-off approach in league championship algorithm for solving large-scale support vector machine problems

there are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. league championship algorithm is such algorithm which may be used in the mentioned problems. in the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. the proposed algori...

متن کامل

A Hybrid Approach for Solving Large Scale Crew Scheduling Problems

We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particul...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of information science and management

جلد ۳، شماره ۱، صفحات ۷۲-۸۶

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023